The parallel replica method for computing equilibrium averages of Markov chains
نویسنده
چکیده
An algorithm is proposed for computing equilibrium averages of Markov chains which su er from metastability – the tendency to remain in one or more subsets of state space for long time intervals. The algorithm, called the parallel replica method (or ParRep), uses many parallel processors to explore these subsets more e ciently. Numerical simulations on a simplemodel demonstrate consistency of themethod. A proof of consistency is given in an idealized setting. The parallel replica method can be considered a generalization of A. F. Voter’s parallel replica dynamics, originally developed to e ciently simulate metastable Langevin stochastic dynamics.
منابع مشابه
Stationary Averaging for Multiscale Continuous Time Markov Chains Using Parallel Replica Dynamics∗
We propose two algorithms for simulating continuous time Markov chains in the presence of metastability. We show that the algorithms correctly estimate, under the ergodicity assumption, stationary averages of the process. Both algorithms, based on the idea of the parallel replica method, use parallel computing in order to explore metastable sets more efficiently. The algorithms require no assum...
متن کاملThe Parallel Replica Method for Simulating Long Trajectories of Markov Chains
The parallel replica dynamics, originally developed by A. F. Voter, efficiently simulates very long trajectories of metastable Langevin dynamics. We present an analogous algorithm for discrete time Markov processes. Such Markov processes naturally arise, for example, from the time discretization of a continuous time stochastic dynamics. Appealing to properties of quasistationary distributions, ...
متن کاملMonte Carlo Methods for Rough Free Energy Landscapes: Population Annealing and Parallel Tempering
Parallel tempering and population annealing are both effective methods for simulating equilibrium systems with rough free energy landscapes. Parallel tempering, also known as replica exchange Monte Carlo, is a Markov chain Monte Carlo method while population annealing is a sequential Monte Carlo method. Both methods overcome the exponential slowing associated with high free energy barriers. The...
متن کاملA decentralized parallel implementation for parallel tempering algorithm
Parallel tempering (PT), also known as replica exchange, is a powerful Markov Chain Monte Carlo sampling approach, which aims at reducing the relaxation time in simulations of physical systems. In this paper, we present a novel decentralized parallel implementation of PT using the message passing interface (MPI) and the scalable parallel random number generators (SPRNG) library. By taking advan...
متن کاملEmpirical Bayes Estimation in Nonstationary Markov chains
Estimation procedures for nonstationary Markov chains appear to be relatively sparse. This work introduces empirical Bayes estimators for the transition probability matrix of a finite nonstationary Markov chain. The data are assumed to be of a panel study type in which each data set consists of a sequence of observations on N>=2 independent and identically dis...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Monte Carlo Meth. and Appl.
دوره 21 شماره
صفحات -
تاریخ انتشار 2015